Sliver, a Fast Distributed Slicing Algorithm
نویسندگان
چکیده
Slicing a distributed system involves partitioning the nodes into k equal-size subsets using a onedimensional attribute. A new gossip-based slicing algorithm that we call Sliver is proposed here; relative to alternatives, it converges more rapidly to an accurate solution and does a better job of tolerating churn. The low cost and simplicity of the solution makes it appropriate for use in a wide range of practical settings.
منابع مشابه
Brief Announcement: A Fast Distributed Slicing Algorithm∗
1. THE SLICING PROBLEM Many studies have identified heterogeneous distributions of attributes (e.g., storage, bandwidth, load, uptime) in distributed systems. Applications may suffer from ignoring such heterogeneity, as already testified by benefits from super-peers/regular-peers classification. As a step further, partitioning the system into portions or slices of nodes that share similar attri...
متن کاملInternal Model Control of Textile Sliver Drafting Process
The paper is focused on modelling and control of an important textile engineering process: the textile sliver drafting process. This process plays a crucial role in textile production chain because low irregularity of drafted sliver is essential for production of high quality yarn. It is shown that this process can be modelled as a nonlinear time delay system with distributed delays. This model...
متن کاملLow-Complexity Distributed Radio Access Network Slicing: Algorithms and Experimental Results
Radio access network (RAN) slicing is an effective methodology to dynamically allocate networking resources in 5G networks. One of the main challenges of RAN slicing is that it is provably an NP-Hard problem. For this reason, we design near-optimal low-complexity distributed RAN slicing algorithms. First, we model the slicing problem as a congestion game, and demonstrate that such game admits a...
متن کاملGuest Editors' Introduction: Special Section on Autonomic Network Computing
IN the paper “Slicing Distributed Systems,” Gramoli et al. consider the problem of slicing—the partitioning of nodes into subsets using an one-dimensional attribute—in distributed systems. This problem arises in peer-to-peer networks and other popular distributed systems used in today’s large data centers. Slicing can help autonomic systems shift work dynamically among nodes and react dynamical...
متن کاملOn Slicing a Distributed Computation
We introduce the notion of a slice of a distributed computation. A slice of a distributed computation with respect to a global predicate is a computation which captures those and only those consistent cuts of the original computation which satisfy the global predicate. We show that a slice exists for a global predicate iff the predicate is a regular predicate. We then give an efficient algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008